Constrained systems with unconstrained positions
نویسندگان
چکیده
منابع مشابه
Constrained systems with unconstrained positions
We develop methods for analyzing and constructing combined modulation/error-correctiong codes (ECC codes), in particular codes that employ some form of reversed concatenation and whose ECC decoding scheme requires easy access to soft information (e.g., turbo codes, low-density parity-check (LDPC) codes or parity codes). We expand on earlier work of Immink and Wijngaarden and also of Fan, in whi...
متن کاملSingular constrained linear systems
In the linear system Ax = b the points x are sometimes constrained to lie in a given subspace S of column space of A. Drazin inverse for any singular or nonsingular matrix, exist and is unique. In this paper, the singular consistent or inconsistent constrained linear systems are introduced and the effect of Drazin inverse in solving such systems is investigated. Constrained linear system arise ...
متن کاملCUTEst: a Constrained and Unconstrained Testing Environment with safe threads
We describe the most recent evolution of our constrained and unconstrained testing environment and its accompanying SIF decoder. Code-named SIFDecode and CUTEst, these updated versions feature dynamic memory allocation, a modern thread-safe Fortran modular design, a new Matlab interface and a revised installation procedure integrated with GALAHAD. 1 Scientific Computing Department, Rutherford A...
متن کاملConstrained Pseudorandom Functions for Unconstrained Inputs
A constrained pseudo random function (PRF) behaves like a standard PRF, but with the added feature that the (master) secret key holder, having secret key K, can produce a constrained key, K{f}, that allows for the evaluation of the PRF on all inputs satisfied by the constraint f . Most existing constrained PRF constructions can handle only bounded length inputs. In a recent work, Abusalah et al...
متن کاملUnconstrained and Constrained Fault-Tolerant Resource Allocation
First, we study the Unconstrained Fault-Tolerant Resource Allocation (UFTRA) problem (a.k.a. FTFA problem in [19]). In the problem, we are given a set of sites equipped with an unconstrained number of facilities as resources, and a set of clients with setR as corresponding connection requirements, where every facility belonging to the same site has an identical opening (operating) cost and ever...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2002
ISSN: 0018-9448
DOI: 10.1109/18.992774